Notes on NP Completeness
نویسنده
چکیده
Here are some notes which I wrote to try to understand what NP completeness means. Most of these notes are taken from Appendix B in Douglas West’s graph theory book, and also from wikipedia. There’s nothing remotely original about these notes. I just wanted all this material to filter through my brain and onto paper. I also wanted to collect everything together in a way I like. Here’s what these notes do.
منابع مشابه
Using Interactive Visualization for Teaching the Theory of Np-completeness
In this paper we investigate the potential of interactive visualiza-tion for teaching the theory of NP-completeness to undergraduate students of computer science. Based on this analysis we developed some interactive Java applets which we use to present an NP-complete tiling problem PUZZLE in our lecture. This software is integrated into our hypertext lecture notes and our students also use it t...
متن کاملBasics of Steiner Minium Trees
These notes give a brief introduction to the NP-completeness of the Steiner problem for graphs.
متن کاملThe Computational Complexity of the Kakuro Puzzle, Revisited
We present a new proof of NP-completeness for the problem of solving instances of the Japanese pencil puzzle Kakuro (also known as Cross-Sum). While the NP-completeness of Kakuro puzzles has been shown before [T. Seta. The complexity of CROSS SUM. IPSJ SIG Notes, AL-84:51–58, 2002], there are still two interesting aspects to our proof: we show NP-completeness for a new variant of Kakuro that ha...
متن کاملNotes on Complexity Theory Last updated : October , 2015 Lecture 6
As in our previous study of NP, it is useful to identify those problems that capture the essence of PSPACE in that they are the “hardest” problems in that class. We can define a notion of PSPACE-completeness in a manner exactly analogous to NP-completeness: Definition 1 Language L′ is PSPACE-hard if for every L ∈ PSPACE it holds that L ≤p L′. Language L′ is PSPACE-complete if L′ ∈ PSPACE and L′...
متن کاملThe complexity of the Weight Problem for permutation groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this paper we show that this problem is NP-complete for many well known metrics.
متن کامل